Application of GRASP methodology to Vehicle Routing Problem (VRP)
نویسندگان
چکیده
In this work the development and implementation of a Decision Support System is described. It will assist in the route calculation process and in optimizing the filling of the trucks that have to transport a considerably number of vehicles from near of 8 origins to more than 3,000 possible destinations spread over Spain and Portugal, and some in France, Germany, etc. The problem can be classified as VRP (Vehicle Routing Problem), been a hybrid between the VRPTW (VRP with Time Windows) and MDVRP (Multi Depot VRP). For its resolution, a Web application using a GRASP methodology as an optimization tool has been developed. The experiments carried out prove an improvement in the results of the freights/routes planning when the DSS is used. The improvement is measured trough the percentage of daily vehicles dispatched, the decrease of the shipment delay, and truck use, among others.
منابع مشابه
Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملCooperative vehicle routing problem: an opportunity for cost saving
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کامل